Martingale rates and weakly exchangeable arrays

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Re-sampling and exchangeable arrays

The non-parametric, or re-sampling, bootstrap for a single unstructured sample corresponds to the algebraic operation of monoid composition, with a uniform distribution on the monoid. With this interpretation, the notion of re-sampling can be extended to designs having a certain group-invariance property. Two types of exchangeable array structures are considered in some detail, namely the one-w...

متن کامل

Exchangeable random arrays

These notes were written to accompany a sequence of workshop lectures at the Indian Institute of Science, Bangalore in January 2013. My lectures had two purposes. The first was to introduce some of the main ideas of exchangeability theory at a level suitable for graduate students (assuming familiarity with measure-theoretic probability). The second was to show the key rôle exchangeability has p...

متن کامل

Weakly Equivalent Arrays

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and extensionality axioms originally proposed by McCarthy. Various filters are used to limit the number of axiom instantiations while preserving completeness. We present ...

متن کامل

A strong law of large numbers for martingale arrays

Abstract: We prove a martingale triangular array generalization of the Chow-BirnbaumMarshall’s inequality. The result is used to derive a strong law of large numbers for martingale triangular arrays whose rows are asymptotically stable in a certain sense. To illustrate, we derive a simple proof, based on martingale arguments, of the consistency of kernel regression with dependent data. Another ...

متن کامل

Asymptotic normality of recursive algorithms via martingale difference arrays

are such that if input data of size N produce random costs LN , then LN D = Ln + L̄N−n + RN for N ≥ n0 ≥ 2, where n follows a certain distribution PN on the integers {0, . . . ,N} and Lk D = L̄k for k ≥ 0. Ln, LN−n and RN are independent, conditional on n, and RN are random variables, which may also depend on n, corresponding to the cost of splitting the input data of size N (into subsets of size...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1980

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700006791